New Interpolation Algorithms for Multiple-Valued Reed-Muller Forms
نویسندگان
چکیده
This paper presents new algorithms for the sparse multivariate polynomial interpolation over nite elds, which can be used for optimizing Reed-Muller forms for MVL functions. Starting with a new quadratic time interpolation algorithm for Boolean functions, we develop a method that decomposes the problem into several smaller problems for the MVL case. We then show how each of these problems can be solved by a practical probabilistic algorithm. The approach is extended to xed polarity RM forms, in which the complexity of the resulting forms becomes simpler and also the running time of the algorithm is reduced.
منابع مشابه
Multiple valued input generalised Reed-Muller forms - Computers and Digital Techniques [see also IEE Proceedings-Computers and Digital Techniques], IEE
The concept of canonical multiple valued input generalised Reed-Muller (MIGRM) forms is introduced. The MIGRM is a direct extension of the well known generalised ReedMuller (GRM) forms to the logic with multiple valued inputs. The concept of the polarity of a GRM form is generalised to the polarity matrix of a MIGRM form. A tabular pattern-matching method is presented for the calculation of a M...
متن کاملEvaluation of -valued Fixed Polarity Generalizations of Reed-Muller Canonical Form
This paper compares the complexity of three different fixed polarity generalizations of Reed-Muller canonical form to multiple-valued logic: the Galois Field-based expansion introduced by Green and Taylor, the Reed-MullerFourier form of Stanković and Moraga, and the expansion over addition modulo , minimum and the set of all literal operators introduced by the author and Muzio. An algorithm for...
متن کاملReed-Muller Forms for Incompletely Specified Functions via Sparse Polynomial Interpolation
In this paper we investigate the possibility of exploiting incompletely specified functions for the purpose of minimizing Reed-Muller (RM) forms. All the previous work in this area has been based on exhaustive search for the optimal solution, or on some approximations to it. Here we show that an alternative approach can bring better results: the definition of the MVL RM transforms as a polynomi...
متن کاملEasily Testable Multiple-Valued Logic Circuits Derived from Reed-Muller Circuits
ÐIn 1972, Reddy showed that the binary circuits realizing Reed-Muller canonical form are easily testable. In this paper, we extend Reddy's result to multiple-valued logic circuits, employing more than two discrete levels of signal. The electronic fabrication of such circuits became feasible due to the recent advances in integrated circuit technology. We show that, in the multiple-valued case, s...
متن کاملA Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
We present a new multivariate interpolation algorithm over arbitrary fields which is primarily suited for small finite fields. Given function values at arbitrary t points, we show that it is possible to find an n-variable interpolating polynomial with at most t terms, using the number of field operations that is polynomial in t and n. The algorithm exploits the structure of the multivariate gen...
متن کامل